Analysis of acceleration strategies for restarted minimal residual methods
نویسندگان
چکیده
منابع مشابه
A Numerical Study of Acceleration Schemes for Restarted Minimum Residual Methods
The two main approaches for solving linear systems of equations with Krylov subspace methods differ in the schemes used to generate suitable basis vectors for computing corrections to the approximate solution. In the early 90s, the introduction of look-ahead techniques to stabilize the Lanczos process along with the QMR method made biorthogonalization methods an attractive approach due to their...
متن کاملMultigrid with Inexact Minimal Residual Smoothing Acceleration
We introduce some inexact versions of the minimal residual smoothing (IMRS) technique to accelerate the standard multigrid convergence. These are modiied versions of the minimal residual smoothing (MRS) technique introduced in an earlier paper 26]. The IMRS acceleration schemes minimize the residual norm of the multigrid iterate in a subspace and reduce the cost of the standard MRS acceleration...
متن کاملEvaluation of Acceleration Techniques for the Restarted Arnoldi Method
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = λx. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of t...
متن کاملTwo-grid analysis of minimal residual smoothing as a multigrid acceleration technique
We analyze the two-level method accelerated by a minimal residual smoothing (MRS) technique. The two-grid analysis is suucient for our purpose because our MRS acceleration scheme is only applied on the nest level of the multigrid method. We prove that the MRS acceleration scheme is a semi-iterative method with respect to the underlying two-level iteration and that the MRS accelerated two-level ...
متن کاملNew conditions for non-stagnation of minimal residual methods
In the solution of large linear systems, a condition guaranteeing that a minimal residual Krylov subspace method makes some progress, i.e., that it does not stagnate, is that the symmetric part of the coefficient matrix be positive definite. This condition results in a well-established worst-case bound for the convergence rate of the iterative method, due to Elman. This bound has been extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00398-8